Syntactic methods in nite semigroup theory
نویسنده
چکیده
This paper is a survey of recent results in the theory of nite semigroups using syntactic techniques. This involves manipulating pseudoidentities and the study of relatively free proonite semigroups, whose structure encodes algebraic and combinatorial properties common to the members of a pseudovariety of semigroups. These techniques are illustrated with applications in the study of semigroups of order-preserving mappings, R-trivial semigroups, and semidirect products.
منابع مشابه
Syntactic and Global Semigroup Theory, a Synthesis Approach
This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of semigroups. We introduce various abstract and algorithmic properties that a pseudovariety of semi-groups might possibly satisfy. The main theorem states that given a nite collection of pseudovarieties, each s...
متن کاملProfinite Methods in Semigroup Theory
A highlight of the Conference held at the University of Nebraska-Lincoln in May 2000 was the proof of the decidability of the complexity of nite semigroups and automata, presented by Rhodes 78]. This problem had been open for more than thirty years and had inspired many active branches of semigroup theory. As is usually the case with old and diicult problems, the solution for the original quest...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملSyntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups
The syntactic semigroup problem is to decide whether a given finite semigroup is syntactic or not. This work investigates the syntactic semigroup problem for both the semigroup reducts of A(Bn), the affine nearsemiring over a Brandt semigroup Bn. It is ascertained that both the semigroup reducts of A(Bn) are syntactic semigroups.
متن کاملPiecewise and Local Threshold Testability of DFA
The necessary and sucient conditions for an automaton to be locally threshold testable are found. We introduce the polynomial time algorithm to verify local threshold testability of the automaton of time complexity O(n 5) and an algorithm of order O(n 3) for the local threshold testability problem for syntactic semigroup of the automaton. We modify necessary and sucient conditions for piecewise...
متن کامل